A L M N B X . Y . Z X 1 . Y 1 . Z 1 Source Dest . Regional Regional NSFnet backbone Fig 1 : Routing Information Flow
نویسنده
چکیده
The Internet is a complex mesh of networks that use a common suite (TCP/IP) of networking protocols. A key feature of the Internet is that all of these constituent networks are interconnected, thereby providing system wide communication. The magnitude and pattern of the ow of routing information directly represents the con-nectivity stability of the Internet. The NSFNET backbone network provides transit services to a large portion of the global Internet and maintains routing tables re-ecting this current connectivity. These routing tables are constantly updated based on information received by the attached networks. This paper investigates the dynamics of routing information ow as presented to the NSFNET backbone network.
منابع مشابه
A Memory-Storable Quantum-Inspired Evolutionary Algorithm for Network Coding Resource Minimization
Network coding technology is a new communication paradigm that is superior to traditional routing in many aspects, especially in terms of the ability of increasing multicast throughput (Ahlswede et al., 2000; Li et al., 2003). Traditional routing adopts store-andforward data forwarding scheme at every intermediate node that simply replicates and forwards the incoming data to downstream nodes. H...
متن کاملCMPT 881 - Pseudorandomness : Solutions to Problem Set 2
(a) In this question you are asked to show that randomness extraction is possible only from sources that are statistically close to sources with high min-entropy; thus, high minentropy is both sufficient and necessary for randomness extraction. More formally, let X be any distribution over {0, 1}n and let Ext : {0, 1}n × {0, 1}d → {0, 1}m. Suppose that Ext(X,Ud) is ǫ-close to the uniform distri...
متن کاملOn Regularly Branched Maps Dedicated to Professor S. Nedev for His 60th Birthday H. Murat Tuncali and Vesko Valov
Let f : X → Y be a perfect map between finite-dimensional metrizable spaces and p ≥ 1. It is shown that the set of all f -regularly branched maps g ∈ C∗(X,R) contains a dense Gδ-subset of C∗(X,R) with the source limitation topology. Here, a map g : X → R is f -regularly branched if, for every n ≥ 1, the dimension of the set {z ∈ Y × R : |(f × g)−1(z)| ≥ n} is ≤ n · ( dim f + dimY ) − (n − 1) · (
متن کاملar X iv : 1 20 3 . 16 69 v 2 [ he p - ex ] 2 A pr 2 01 2 Observation of electron - antineutrino disappearance at Daya Bay
F. P. An,1 J. Z. Bai,1 A. B. Balantekin,2 H. R. Band,2 D. Beavis,3 W. Beriguete,3 M. Bishai,3 S. Blyth,4 K. Boddy,5 R. L. Brown,3 B. Cai,5 G. F. Cao,1 J. Cao,1 R. Carr,5 W. T. Chan,3 J. F. Chang,1 Y. Chang,4 C. Chasman,3 H. S. Chen,1 H. Y. Chen,6 S. J. Chen,7 S. M. Chen,8 X. C. Chen,9 X. H. Chen,1 X. S. Chen,1 Y. Chen,10 Y. X. Chen,11 J. J. Cherwinka,2 M. C. Chu,9 J. P. Cummings,12 Z. Y. Deng,1...
متن کاملOn Some k-Dimensional Cyclic Systems of Difference Equations
and Applied Analysis 3 Proof. The results follow directly from the following fact: F(x, y) y 1 − y 2r xr yr x 1 − x2r xr yr . 2.1 For simplicity, systems 1.2 and 1.3 can be respectively rewritten in the following forms: z i n F ( z i n−l, z θ i 1 n−m ) , i 1, 2, . . . , k, n ∈ N0, 2.2 z i n 1 F ( z i n−p, z θ i 1 n−q ) , i 1, 2, . . . , k, n ∈ N0. 2.3 Lemma 2.2. Denote a transformation ŷ ⎧ ⎪⎨ ⎪...
متن کامل